Abstracting out Byzantine Behavior
نویسندگان
چکیده
ing out Byzantine Behavior Peter Druschel, Andreas Haeberlen, Petr Kouznetsov Max Planck Institute for Software Systems MPI-SWS, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany {druschel,ahae,pkouznet}@mpi-sws.mpg.de Abstract. Many distributed systems are designed to tolerate the presence of Byzantine failures: an individual process may arbitrarily deviate Many distributed systems are designed to tolerate the presence of Byzantine failures: an individual process may arbitrarily deviate from the algorithm assigned to it. Depending on the application requirements, systems enjoy various levels of fault-tolerance. Systems based on state machine replication are able to mask failures so that their effect is not visible by the application. In contrast, cooperative peer-to-peer systems can tolerate bounded deviant behavior to some extent and therefore do not require masking, as long as each faulty node is exposed eventually. Finding an abstract way to reason about the levels of fault-tolerance is thus of immanent importance. In this paper, we discuss how the information of deviant behavior can be abstracted out in the form of a Byzantine failure detector (BFD). We formally define a BFD abstraction, and we discuss two ways of using the abstraction: (1) monitoring systems in order to retroactively detect Byzantine failures and (2) enforcing systems in order to boost their level of fault-tolerance. Interestingly, the BFD formalism allowed us to determine the relative hardness of implementing two popular abstractions in distributed computing: state machine replication and weak interactive consistency.
منابع مشابه
Byzantine robust trust establishment for mobile ad hoc networks
In a mobile ad hoc network (MANET), the nodes act both as traffic sources and as relays that forward packets from other nodes along multi-hop routes to the destination. Such networks are suited to situations in which in a wireless infrastructure is unavailable, infeasible, or prohibitively expensive. However, the lack of a secure, trusted infrastructure in such networks, make secure and reliabl...
متن کاملConsensus in byzantine asynchronous systems
This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is an unreliable failure detector module of the class 3S(bz). The second is a reliable arbitrary behavior detection module. More precisely, the first module detects processes that stop sending messages, while processe...
متن کاملPseudo-Kufi: Reflection of the Islamic Art in the Byzantine Art
Calligraphy was very important from the beginning in Islamic civilization because of the Rasm of the Holy Quran. The presence and application of the Kufic script, as one of the most common forms of calligraphy in the early Islamic age, with its own visual and conceptual features in the Greek churches and monasteries of the tenth and eleventh centuries (fourth and fifth centuries (AH)) raises ma...
متن کاملAsynchronous Byzantine Machine Learning
Asynchronous distributed machine learning solutions have proven very effective so far, but always assuming perfectly functioning workers. In practice, some of the workers can however exhibit Byzantine behavior, caused by hardware failures, software bugs, corrupt data, or even malicious attacks. We introduce Kardam, the first distributed asynchronous stochastic gradient descent (SGD) algorithm t...
متن کاملAn On-Demand Byzantine-Resilient Secure Routing Protocol for Wireless Adhoc Networks
Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. We refer to any arbitrary action by authenticated nodes resulting in disruption of the routing service such as drop packets, modify packets and miss-route packets as Byzantine behavior, and to such an adversary as a Byzantine adversary. Nodes may exhibit Byzantine beh...
متن کامل